By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 7, Issue 3, pp. 239-391

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Data Movement in Odd-Even Merging

Robert Sedgewick

pp. 239-272

BibTeX  Abstract Full Text:  PDF

Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems

Kellogg S. Booth

pp. 273-279

BibTeX  Abstract Full Text:  PDF

Finding All Spanning Trees of Directed and Undirected Graphs

Harold N. Gabow and Eugene W. Myers

pp. 280-287

BibTeX  Abstract Full Text:  PDF

Efficient Calculation of Expected Miss Ratios in the Independent Reference Model

Ronald Fagin and Thomas G. Price

pp. 288-297

BibTeX  Abstract Full Text:  PDF

Implementation and Analysis of Binomial Queue Algorithms

Mark R. Brown

pp. 298-319

BibTeX  Abstract Full Text:  PDF

Deadlock Prediction: Easy and Difficult Cases

E. Mark Gold

pp. 320-336

BibTeX  Abstract Full Text:  PDF

Approximate Reduction and Lambda Calculus Models

Christopher P. Wadsworth

pp. 337-356

BibTeX  Abstract Full Text:  PDF

Correcting Counter-Automaton-Recognizable Languages

Robert A. Wagner and Joel I. Seiferas

pp. 357-375

BibTeX  Abstract Full Text:  PDF

Generalized Syntax Directed Translation, Tree Transducers, and Linear Space

Brenda S. Baker

pp. 376-391

BibTeX  Abstract Full Text:  PDF